A novel task scheduling approach for dependent non‐preemptive tasks using fuzzy logic

Multiprocessor task scheduling problem is a pressing that affects systems' performance and still being investigated by the researchers. Finding optimal schedules considered to be computationally hard problem. Recently, researchers have used fuzzy logic in field of achieve performance, but this area research not well investigated. In addition, there are various algorithms most them often performed on uniprocessor systems. This article presents new proposed algorithm which priorities tasks derived from bottom level parameter. approach designed find with or sub-optimal lengths order high for multiprocessor environment. With respect algorithm, precedence constraints between non-preemptive their execution times known described directed acyclic graph. The number processors fixed, communication costs negligible homogeneous. suggested technique tested compared Prototype Standard Task Graph Set.